Complexity-style resources in cryptography

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity-Style Resources in Cryptography

Previously, the author has developed a framework within which to quantify and compare the resources consumed during computational—especially unconventional computational—processes (adding to the familiar resources of run-time and memory space such non-standard resources as precision and energy); it is natural and beneficial in this framework to employ various complexity-theoretic tools and tech...

متن کامل

Kolmogorov complexity and cryptography

We consider (in the framework of algorithmic information theory) questions of the following type: construct a message that contains different amounts of information for recipients that have (or do not have) certain a priori information. Assume, for example, that the recipient knows some string a, and we want to send her some information that allows her to reconstruct some string b (using a). On...

متن کامل

Complexity and cryptography - an introduction

Cryptography plays a crucial role in many aspects of today’s world, from internet banking and ecommerce to email and web-based business processes. Understanding the principles on which it is based is an important topic that requires a knowledge of both computational complexity and a range of topics in puremathematics. This book provides that knowledge, combining an informal style with rigorous ...

متن کامل

Bounded Arithmetic, Cryptography and Complexity

This survey discusses theories of bounded arithmetic, growth rates of definable functions, natural proofs, interpolation theorems, connections to cryptography, and the difficulty of obtaining independence results.

متن کامل

Fixed-Parameter Complexity and Cryptography

We discuss the issue of the parameterized computational complexity of a number of problems of interest in cryptography. We show that the problem of determining whether an n-digit number has a prime divisor less than or equal to n k can be solved in expected time f(k)n 3 by a randomized algorithm that employs elliptic curve factorization techniques (this result depends on an unproved but plausib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2013

ISSN: 0890-5401

DOI: 10.1016/j.ic.2013.03.002